On Stochastic Games with Multiple Objectives Taolue Chen, Vojtˇech Forejt, Marta Kwiatkowska, Aistis Simaitis, and Clemens Wiltsche Department of Computer Science, University of Oxford, United Kingdom Abstract. We stud

Source URL: qav.comlab.ox.ac.uk

• Mathematical analysis
• Measure theory
• Mathematics
• Probability and statistics
• Determinacy
• Stochastic game
• Strategy
• Markov chain
• Stochastic process
• Support
• Mathematical optimization
• Statistical model

Softstar: Heuristic-Guided Probabilistic Inference Mathew Monfort Computer Science Department University of Illinois at Chicago Chicago, IL 60607

Source URL: cims.nyu.edu

• Search algorithms
• Routing algorithms
• Combinatorial optimization
• Mathematics
• Information science
• Information retrieval
• Game artificial intelligence
• A* search algorithm
• Heuristic
• Bayesian network
• Dijkstra's algorithm
• Algorithm

Challenges for Fast Synthesis Procedures in SMT Andrew Reynolds1 Department of Computer Science, The University of Iowa Abstract A number of synthesis applications are made possible by automated tools for synthesis. Rece

Source URL: www.cs.man.ac.uk

• Mathematical logic
• Theoretical computer science
• Mathematics
• Quantification
• Logic in computer science
• Formal methods
• Electronic design automation
• NP-complete problems
• Satisfiability modulo theories
• Boolean satisfiability problem
• Universal quantification
• True quantified Boolean formula

Structural Properties in δ-Hyperbolic Networks: Algorithmic Analysis and Implications Hend Alrasheed Kent State University, Department of Computer Science Kent Ohio, USA

Source URL: gdac.uqam.ca

• Graph theory
• Network theory
• Bipartite graphs
• Graph operations
• Centrality
• Network analysis
• Distance
• Graph
• Connectivity
• Tree
• Shortest path problem
• Degeneracy

Designing Theory Solvers with Extensions Andrew Reynolds1 , Cesare Tinelli1 , Dejan1 Jovanovi´c3 , and Clark Barrett2 1 Department of Computer Science, The University of Iowa Department of Computer Science, Stanford Uni

Source URL: csl.sri.com

• Theoretical computer science
• Mathematics
• Mathematical logic
• Logic in computer science
• Automated theorem proving
• Electronic design automation
• Formal methods
• NP-complete problems
• Satisfiability modulo theories
• Boolean satisfiability problem
• Substitution
• Model theory

The University of York Department of Computer Science Programming Languages and Systems Group Unfailing Haskell Qualifying Dissertation

Source URL: community.haskell.org

• Software engineering
• Computer programming
• Declarative programming
• Functional languages
• Functional programming
• Recursion
• Higher-order functions
• Programming language comparisons
• Haskell
• Lazy evaluation
• ML
• Conditional

James Caldwell Department of Computer Science University of Wyoming Laramie, WYDATE: October 31, 2016

Source URL: www.cs.uwyo.edu

• Automated theorem proving
• Theoretical computer science
• Computing
• Mathematics
• Nuprl
• Interactive Theorem Proving
• Proof assistant
• Robert Lee Constable
• ACL2
• Formal methods
• Computer science
• Automated reasoning

On Frequency LTL in Probabilistic Systems Vojtěch Forejt1 and Jan Krčál2 1 2 Department of Computer Science, University of Oxford, UK

Source URL: qav.comlab.ox.ac.uk

• Temporal logic
• Theoretical computer science
• Model checking
• Finite automata
• Linear temporal logic
• Mathematical logic
• Formal languages
• Mathematics
• Bchi automaton
• Omega language
• Markov decision process
• Computation tree logic

Designing Robust Software Systems through Parametric Markov Chain Synthesis ˇ ska† , Simos Gerasimou∗ , Marta Kwiatkowska‡ and Nicola Paoletti§ Radu Calinescu∗ , Milan Ceˇ ∗ Department of Computer Science, U

Source URL: qav.comlab.ox.ac.uk

Department of Computer Science INCREMENTAL RUNTIME VERIFICATION OF PROBABILISTIC SYSTEMS Vojtˇech Forejt

Source URL: www.cs.ox.ac.uk

• Dynamic programming
• Markov processes
• Stochastic control
• Markov models
• Probability
• Markov decision process
• Markov chain
• PP
• Probabilistic CTL
• Model checking